On the Optimal Scheduling in Pull-based Real-Time P2P Streaming Systems
نویسندگان
چکیده
During the last decade, we witnessed a rapid growth in deployment of pull-based P2P streaming applications. In these applications, each node selects some other nodes as its neighbors and requests streaming data from them. This scheme allows eliminating data redundancy and recovering from data loss, but it pushes the complexity to the receiver node side. In this paper, we theoretically study the scheduling problem in Pull-based P2P video streaming and we model it as an assignment problem. Then, we propose AsSched, new scheduling algorithm for layered streaming, in order to optimize the throughput and the delivery ratio of the system. In second time, we derive an optimal algorithm (NAsSched) for non layered streaming. The results of simulations show that our algorithms significantly outperform classic scheduling strategies especially in stern bandwidth constraints. KeywordsP2P; scheduling; layered streaming; non-layered streaming; QoS
منابع مشابه
Optimal Scheduling of CHP-based Microgrid Under Real-Time Demand Response Program
Microgrid (MG) is considered as a feasible solution to integrate the distributed energy sources. In this paper, optimal scheduling of a grid-connected MG is investigated considering different power sources as combined heat and power (CHP) units, only power and heat generating units, and battery storage systems. Two different feasible operating regions are considered for the CHP units. In additi...
متن کاملAdaptive Queue-based Chunk Scheduling for P2P Live Streaming
P2P streaming has been popular and is expected to attract even more users. The challenges for P2P streaming have been on its scalability and video viewing quality. Both require efficient utilization of resources in P2P networks. This paper proposes an adaptive queue-based chunk scheduling method. The proposed scheme can achieve high bandwidth utilization and optimal streaming rate possible in a...
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملExploring a QoS Driven Scheduling Approach for Peer-to-Peer Live Streaming Systems with Network Coding
Most large-scale peer-to-peer (P2P) live streaming systems use mesh to organize peers and leverage pull scheduling to transmit packets for providing robustness in dynamic environment. The pull scheduling brings large packet delay. Network coding makes the push scheduling feasible in mesh P2P live streaming and improves the efficiency. However, it may also introduce some extra delays and coding ...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کامل